Convergent meshfree approximation schemes of arbitrary order and smoothness
نویسندگان
چکیده
Article history: Received 3 August 2011 Received in revised form 25 November 2011 Accepted 31 January 2012 Available online 15 February 2012
منابع مشابه
Verification and Validation of Common Derivative Terms Approximation in Meshfree Numerical Scheme
In order to improve the approximation of spatial derivatives without meshes, a set of meshfree numerical schemes for derivative terms is developed, which is compatible with the coordinates of Cartesian, cylindrical, and spherical. Based on the comparisons between numerical and theoretical solutions, errors and convergences are assessed by a posteriori method, which shows that the approximations...
متن کاملSmooth, second order, non-negative meshfree approximants selected by maximum entropy
We present a family of approximation schemes, which we refer to as second-order maximum-entropy (max-ent) approximation schemes, that extends the first-order local max-ent approximation schemes to second-order consistency. This method retains the fundamental properties of first-order max-ent schemes, namely the shape functions are smooth, non-negative, and satisfy a weak Kronecker-delta propert...
متن کاملAn Extended Error Analysis for a Meshfree Discretization Method of Darcy's Problem
Recently ([21]), a new meshfree approximation method for Darcy’s problem has been introduced and analyzed. This method is based on a symmetric collocation approach using radial basis functions producing solutions with an analytically divergence-free velocity part. However, the error analysis provided in [21] works only for smooth solutions, where the smoothness is intrinsically linked to the sm...
متن کاملPolynomial reproduction for univariate subdivision schemes of any arity
In this paper we study the ability of convergent subdivision schemes to reproduce polynomials in the sense that for initial data, which is sampled from some polynomial function, the scheme yields the same polynomial in the limit. This property is desirable because the reproduction of polynomials up to some degree d implies that a scheme has approximation order d +1. We first show that any conve...
متن کاملApproximation of ruled and canal surfaces by means of subdivision
Subdivision schemes were originally defined for data in affine spaces and their applications were thus restricted to polygons and polyhedra. Nowadays subdivision schemes for data in arbitrary manifolds are available and the convergence and smoothness behaviour is studied. This opens a wide field of applications and makes it posible to apply suitably modified known refinement schemes to sets of ...
متن کامل